118 research outputs found
Large Cayley graphs of small diameter
The degree-diameter problem seeks to find the largest possible number of vertices in a graph having given diameter and given maximum degree. Very often the problem is studied for restricted families of graph such as vertex-transitive or Cayley graphs, with the goal being to find a family of graphs with good asymptotic properties. In this paper we restrict attention to Cayley graphs, and study the asymptotics by fixing a small diameter and constructing families of graphs of large order for all values of the maximum degree. Much of the literature in this direction is focused on the diameter two case. In this paper we consider larger diameters, and use a variety of techniques to derive new best asymptotic constructions for diameters 3, 4 and 5 as well as an improvement to the general bound for all odd diameters. Our diameter 3 construction is, as far as we know, the first to employ matrix groups over finite fields in the degree-diameter problem
On Total Regularity of Mixed Graphs with Order Close to the Moore Bound
The undirected degree/diameter and degree/girth problems and their directed analogues have been studied for many decades in the search for efficient network topologies. Recently such questions have received much attention in the setting of mixed graphs, i.e. networks that admit both undirected edges and directed arcs. The degree/diameter problem for mixed graphs asks for the largest possible order of a network with diameter , maximum undirected degree and maximum directed out-degree . Similarly one can search for the smallest possible -geodetic mixed graphs with minimum undirected degree and minimum directed out-degree . A simple counting argument reveals the existence of a natural bound, the Moore bound, on the order of such graphs; a graph that meets this limit is a mixed Moore graph. Mixed Moore graphs can exist only for and even in this case it is known that they are extremely rare. It is therefore of interest to search for graphs with order one away from the Moore bound. Such graphs must be out-regular; a much more difficult question is whether they must be totally regular. For , we answer this question in the affirmative, thereby resolving an open problem stated in a recent paper of Lopez and Miret. We also present partial results for larger . We finally put these results to practical use by proving the uniqueness of a 2-geodetic mixed graph with order exceeding the Moore bound by one
Builder-Blocker General Position Games
This paper considers a game version of the general position problem in which
a general position set is built through adversarial play. Two players in a
graph, Builder and Blocker, take it in turns to add a vertex to a set, such
that the vertices of this set are always in general position. The goal of
Builder is to create a large general position set, whilst the aim of Blocker is
to frustrate Builder's plans by making the set as small as possible. The game
finishes when no further vertices can be added without creating three-in-a-line
and the number of vertices in this set is the game general position number. We
determine this number for some common graph classes and provide sharp bounds,
in particular for the case of trees. We also discuss the effect of changing the
order of the players
Recommended from our members
Extremal Directed And Mixed Graphs
We consider three problems in extremal graph theory, namely the degree/diameter problem, the degree/geodecity problem and Tur\'{a}n problems, in the context of directed and partially directed graphs.
A directed graph or mixed graph is -geodetic if there is no pair of vertices of such that there exist distinct non-backtracking walks with length in from to . The order of a -geodetic digraph with minimum out-degree is bounded below by the \emph{directed Moore bound} ; similarly the order of a -geodetic mixed graph with minimum undirected degree and minimum directed out-degree is bounded below by the \emph{mixed Moore bound}. We will be interested in networks with order exceeding the Moore bound by some small \emph{excess} .
The \emph{degree/geodecity problem} asks for the smallest possible order of a -geodetic digraph or mixed graph with given degree parameters. We prove the existence of extremal graphs, which we call \emph{geodetic cages}, and provide some bounds on their order and information on their structure.
We discuss the structure of digraphs with excess one and rule out the existence of certain digraphs with excess one. We then classify all digraphs with out-degree two and excess two, as well as all diregular digraphs with out-degree two and excess three. We also present the first known non-trivial examples of geodetic cages.
We then generalise this work to the setting of mixed graphs. First we address the question of the total regularity of mixed graphs with order close to the Moore bound and prove bounds on the order of mixed graphs that are not totally regular. In particular using spectral methods we prove a conjecture of L\'{o}pez and Miret that mixed graphs with diameter two and order one less than the Moore bound are totally regular.
Using counting arguments we then provide strong bounds on the order of totally regular -geodetic mixed graphs and use these results to derive new extremal mixed graphs.
Finally we change our focus and study the Tur\'{a}n problem of the largest possible size of a -geodetic digraph with given order. We solve this problem and also prove an exact expression for the restricted problem of the largest possible size of strongly connected -geodetic digraphs, as well as providing constructions of strongly connected -geodetic digraphs that we conjecture to be extremal for larger . We close with a discussion of some related generalised Tur\'{a}n problems for -geodetic digraphs
Mutually avoiding Eulerian circuits
Two Eulerian circuits, both starting and ending at the same vertex, are
avoiding if at every other point of the circuits they are at least distance 2
apart. An Eulerian graph which admits two such avoiding circuits starting from
any vertex is said to be doubly Eulerian. The motivation for this definition is
that the extremal Eulerian graphs, i.e. the complete graphs on an odd number of
vertices and the cycles, are not doubly Eulerian. We prove results about doubly
Eulerian graphs and identify those that are the `densest' and `sparsest' in
terms of the number of edges.Comment: 22 pages; 9 figure
Small Graphs and Hypergraphs of Given Degree and Girth
The search for the smallest possible d-regular graph of girth g has a long history, and is usually known as the cage problem. This problem has a natural extension to hypergraphs, where we may ask for the smallest number of vertices in a d-regular, r-uniform hypergraph of given (Berge) girth g. We show that these two problems are in fact very closely linked. By extending the ideas of Cayley graphs to the hypergraph context, we find smallest known hypergraphs for various parameter sets. Because of the close link to the cage problem from graph theory, we are able to use these techniques to find new record smallest cubic graphs of girths 23, 24, 28, 29, 30, 31 and 32
Design of a Wearable Balance Control Indicator
Each year, one in three elderly fall. Studies show that many factors contribute to an elderly person\u27s risk of falling, but if the factors causing imbalance are improved, a person\u27s risk of falling may be reduced. A device that detects and alerts the user of an off-balance situation before the fall occurs could identify a specific need for improved balance control. This MQP describes the design, testing, and verification of a prototype wearable device that is worn on the right hip during the sit-to-stand activity (STS) to detect and notify the user of an unbalanced STS. By signaling an off-balance situation during STS, our device notifies the user of poor balance control and identifies the need for balance control improvement
Recommended from our members
On some extremal position problems for graphs
The general position number of a graph is the size of the largest set of vertices such that no geodesic of contains more than two elements of . The monophonic position number of a graph is defined similarly, but with `induced path' in place of `geodesic'. In this paper we investigate some extremal problems for these parameters. Firstly we discuss the problem of the smallest possible order of a graph with given general and monophonic position numbers. We then determine the asymptotic order of the largest size of a graph with given general or monophonic position number, classifying the extremal graphs with monophonic position number two. Finally we establish the possible diameters of graphs with given order and monophonic position number
Recommended from our members
Turán Problems for <i>k</i> -Geodetic Digraphs
A digraph G is k-geodetic if for any pair of (not necessarily distinct) vertices u, v∈V(G) there is at most one walk of length ≤k from u to v in G. In this paper, we determine the largest possible size of a k-geodetic digraph with a given order. We then consider the more difficult problem of the largest size of a strongly-connected k-geodetic digraph with a given order, solving this problem for k=2 and giving a construction which we conjecture to be extremal for larger k. We close with some results on generalised Turán problems for the number of directed cycles and paths in k-geodetic digraphs
On the Vertex Position Number of Graphs
In this paper we generalise the notion of visibility from a point in an
integer lattice to the setting of graph theory. For a vertex of a connected
graph , we say that a set is an \emph{-position set}
if for any the shortest -paths in contain no point of
. We investigate the largest and smallest orders of maximum
-position sets in graphs, determining these numbers for common classes of
graphs and giving bounds in terms of the girth, vertex degrees, diameter and
radius. Finally we discuss the complexity of finding maximum vertex position
sets in graphs.Comment: A new author added. A result on Kneser graphs has been inserted and
the bound for vp^- for triangle-free graphs correcte
- …